int cmp(int* x, int* y)
{
    return *x - *y;
}

double trimMean(int* arr, int arrSize) {
    int x = arrSize * 0.05;
    qsort(arr, arrSize, sizeof(int), cmp);
    double sum = 0.0;
    for (int i = x; i < arrSize - x; i++)
    {
        sum += arr[i];
    }
    return sum / (arrSize - 2 * x);
}